Characteristic automated search of cryptographic algorithms for distinguishing attacks (CASCADA)
نویسندگان
چکیده
Automated search methods based on Satisfiability Modulo Theory (SMT) problems are being widely used to evaluate the security of block ciphers against distinguishing attacks. While these provide a systematic and generic methodology, most their software implementations limited small set attacks, extending requires significant effort expertise. In this work, authors present cryptographic algorithms for attacks (CASCADA), an open-source Python library primitives, specially ciphers, with bit-vector SMT solvers. The tool CASCADA implements property framework herein proposed several SMT-based automated differential, related-key rotational-XOR, impossible-differential, impossible-rotational-XOR, linear zero-correlation cryptanalysis. is result huge engineering effort, it provides many functionalities, modular design, extensive documentation complete suite tests.
منابع مشابه
Secure Bio-Cryptographic Authentication System for Cardless Automated Teller Machines
Security is a vital issue in the usage of Automated Teller Machine (ATM) for cash, cashless and many off the counter banking transactions. Weaknesses in the use of ATM machine could not only lead to loss of customer’s data confidentiality and integrity but also breach in the verification of user’s authentication. Several challenges are associated with the use of ATM smart card such as: card clo...
متن کاملSYMBIOTIC ORGANISMS SEARCH AND HARMONY SEARCH ALGORITHMS FOR DISCRETE OPTIMIZATION OF STRUCTURES
In this work, a new hybrid Symbiotic Organisms Search (SOS) algorithm introduced to design and optimize spatial and planar structures under structural constraints. The SOS algorithm is inspired by the interactive behavior between organisms to propagate in nature. But one of the disadvantages of the SOS algorithm is that due to its vast search space and a large number of organisms, it may trap i...
متن کاملHighly Parallel Cryptographic Attacks
We report on a large-scale statistical evaluation of pseudo-random properties of certain cryptographic functions such as des and md5. The evaluation is based on the well-known birthday attack. The attack requires large amounts of memory. We describe a parallel algorithm which can exploit the large amounts of secondary memory (local disks) available on many workstation clusters and parallel mach...
متن کاملDistinguishing attacks on ISAAC
This paper presents two strong distinguishers for the deterministic random bit generator ISAAC, requiring 2 and 2 samples of respectively 64 and 32 bits, based on the observation that more than 2 167 initial states among the 2 192 ones induce a strongly non-uniform distribution of the bits produced at the first round of the algorithm. A previous attack on ISAAC presented at Asiacrypt’06 by Paul...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Iet Information Security
سال: 2022
ISSN: ['1751-8709', '1751-8717']
DOI: https://doi.org/10.1049/ise2.12077